Logicality of Conditional Rewrite Systems
نویسندگان
چکیده
A conditional term rewriting system is called logical if it has the same logical strength as the underlying conditional equational system. In this paper we summarize known logicality results and we present new sufficient conditions for logicality of the important class of oriented conditional term rewriting systems.
منابع مشابه
Confluence of Conditional Term Rewrite Systems via Transformations
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite systems. Recent results provide confluence criteria for conditional term rewrite systems via transformations, yet they are restricted to CTRSs with ...
متن کاملOn Modularity of Termination and Confluence Properties of Conditional Rewrite Systems
We investigate the modularity behaviour of termination and connuence properties of conditional term rewriting systems. In particular , we show how to obtain suucient conditions for the modularity of weak termination, weak innermost termination, (strong) innermost termination , (strong) termination, connuence and completeness of conditional rewrite systems.
متن کاملA Deterministic Lazy Conditional Narrowing Calculus
(We show the completeness of a deterministic lazy conditional narrowing calculus with leftmost selection for the class of eft-linear fresh deterministic constructorbased conditional rewrite systems. This class of rewrite systems permits extra variables in the right-hand sides and conditions of its rewrite rules. This result is relevant for the designers of suitable computational models for func...
متن کاملStrong Completeness of a Lazy Conditional Narrowing Calculus
In this paper we extend the lazy narrowing calculus of Middeldorp, Okui, and Ida 13] to conditional rewrite systems. We show that our calculus is strongly complete whenever basic conditional narrowing is complete. This generalizes one of the three main results of 13] to the conditional case. As a corollary we obtain the strong completeness for three classes of conditional rewrite systems, one o...
متن کاملTransformations of Conditional Term Rewrite Systems
Term rewriting is a well understood and commonly used framework in theoretical computer science for program analysis and program verification. An intuitive extension of term rewrite systems are conditional term rewrite systems. Yet, although they are more natural for certain tasks, they turn out to be more complex to analyze. In order to better understand and implement conditional term rewrite ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997